Secret sharing

Results: 195



#Item
51Secret sharing schemes – solved and unsolved problems ´szlo ´ Csirmaz, Central European University, Budapest La  The talk surveys the present status of secret sharing schemes: How did it emerge, where and how

Secret sharing schemes – solved and unsolved problems ´szlo ´ Csirmaz, Central European University, Budapest La The talk surveys the present status of secret sharing schemes: How did it emerge, where and how

Add to Reading List

Source URL: www.math.tugraz.at

Language: English - Date: 2008-07-29 07:57:28
    52Smart Meter Aggregation via Secret-Sharing George Danezis, Cédric Fournet, Markulf Kohlweiss, Santiago Zanella-Béguelin Microsoft Research, Cambridge, UK {gdane,fournet,markulf,santiago}@microsoft.com

    Smart Meter Aggregation via Secret-Sharing George Danezis, Cédric Fournet, Markulf Kohlweiss, Santiago Zanella-Béguelin Microsoft Research, Cambridge, UK {gdane,fournet,markulf,santiago}@microsoft.com

    Add to Reading List

    Source URL: www0.cs.ucl.ac.uk

    Language: English - Date: 2013-11-04 03:36:30
    53arXiv:1402.3031v1 [quant-ph] 13 FebControlled Secret Sharing Protocol using a Quantum Cloning Circuit  4

    arXiv:1402.3031v1 [quant-ph] 13 FebControlled Secret Sharing Protocol using a Quantum Cloning Circuit 4

    Add to Reading List

    Source URL: arxiv.org

    Language: English - Date: 2014-02-13 20:25:08
      54Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes Ron Steinfeld, Huaxiong Wang, and Josef Pieprzyk Dept. of Computing, Macquarie University, North Ryde, Australia {rons,hwang,josef}@ics.mq.

      Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes Ron Steinfeld, Huaxiong Wang, and Josef Pieprzyk Dept. of Computing, Macquarie University, North Ryde, Australia {rons,hwang,josef}@ics.mq.

      Add to Reading List

      Source URL: www.iacr.org

      Language: English - Date: 2007-09-06 02:11:53
        55Arpita Patra Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB,

        Arpita Patra Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB,

        Add to Reading List

        Source URL: www.cs.bris.ac.uk

        Language: English - Date: 2012-09-07 07:03:05
        56Poster: Differentially Private Decision Tree Learning from Distributed Data Parisa Kaghazgaran Hassan Takabi

        Poster: Differentially Private Decision Tree Learning from Distributed Data Parisa Kaghazgaran Hassan Takabi

        Add to Reading List

        Source URL: www.ieee-security.org

        Language: English - Date: 2015-05-11 16:42:26
        57Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries∗ Carmit Hazay† Yehuda Lindell†

        Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries∗ Carmit Hazay† Yehuda Lindell†

        Add to Reading List

        Source URL: www.eng.biu.ac.il

        Language: English - Date: 2014-09-16 05:37:56
        58Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries∗ Carmit Hazay† Yehuda Lindell†

        Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries∗ Carmit Hazay† Yehuda Lindell†

        Add to Reading List

        Source URL: www.eng.biu.ac.il

        Language: English - Date: 2014-09-16 05:37:56
        59STUDIES ON VERIFIABLE SECRET SHARING, BYZANTINE AGREEMENT AND MULTIPARTY COMPUTATION A THESIS submitted by

        STUDIES ON VERIFIABLE SECRET SHARING, BYZANTINE AGREEMENT AND MULTIPARTY COMPUTATION A THESIS submitted by

        Add to Reading List

        Source URL: www.cs.bris.ac.uk

        - Date: 2010-05-28 16:00:18
          60BRICS  Basic Research in Computer Science BRICS RS-02-8 Cramer & Fehr: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

          BRICS Basic Research in Computer Science BRICS RS-02-8 Cramer & Fehr: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

          Add to Reading List

          Source URL: www.brics.dk

          - Date: 2002-03-22 09:02:27